Epi-convergent discretizations of multistage stochastic programs via integration quadratures

نویسنده

  • Teemu Pennanen
چکیده

This paper presents procedures for constructing numerically solvable discretizations of multistage stochastic programs that epi-converge to the original problem as the discretizations are made finer. Epi-convergence implies, in particular, that the cluster points of the first-stage solutions of the discretized problems are optimal first-stage solutions of the original problem. The discretization procedures apply to a general class of nonlinear stochastic programs where the uncertain factors are driven by time series models. Using existing routines for numerical integration allows for an easy and efficient implementation of the procedures.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Epi-convergent discretizations of stochastic programs via integration quadratures

The simplest and the best-known method for numerical approximation of high-dimensional integrals is the Monte Carlo method (MC), i.e. random sampling. MC has also become the most popular method for constructing numerically solvable approximations of stochastic programs. However, certain modern integration quadratures are often superior to crude MC in high-dimensional integration, so it seems na...

متن کامل

On Stability of Multistage Stochastic Programs

We study quantitative stability of linear multistage stochastic programs under perturbations of the underlying stochastic processes. It is shown that the optimal values behave Lipschitz continuous with respect to an Lp-distance. Therefor, we have to make a crucial regularity assumption on the conditional distributions, that allows to establish continuity of the recourse function with respect to...

متن کامل

Variance reduction in sample approximations of stochastic programs

This paper studies the use of randomized Quasi-Monte Carlo methods (RQMC) in sample approximations of stochastic programs. In high dimensional numerical integration, RQMC methods often substantially reduce the variance of sample approximations compared to MC. It seems thus natural to use RQMC methods in sample approximations of stochastic programs. It is shown, that RQMC methods produce epi-con...

متن کامل

Convergent Cutting-Plane and Partial-Sampling Algorithm for Multistage Stochastic Linear Programs with Recourse

We propose an algorithm for multistage stochastic linear programs with recourse where random quantities in different stages are independent. The algorithm approximates successively expected recourse functions by building up valid cutting planes to support these functions from below. In each iteration, for the expected recourse function in each stage, one cutting plane is generated using the dua...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Math. Program.

دوره 116  شماره 

صفحات  -

تاریخ انتشار 2009